High performance elliptic curve GF(2k) cryptoprocessor architecture for multimedia
نویسندگان
چکیده
منابع مشابه
Design of Gaussian Normal and Polynomial Basis Multipliers over Gf(2)
This article address efficient hardware implementations for multiplication over GF(2). Hardware implementations of multiplication algorithms are suitable for elliptic curve cryptoprocessor designs, which allow that elliptic curve based cryptosystems implemented in hardware provide more physical security and higher speed than software implementations. In this case, the multipliers were designed ...
متن کاملHigh-performance Public-key Cryptoprocessor for Wireless Mobile Applications
We present a high-speed public-key cryptoprocessor that exploits three-level parallelism in Elliptic Curve Cryptography (ECC) over GF(2n). The proposed cryptoprocessor employs a Parallelized Modular Arithmetic Logic Unit (P-MALU) that exploits two types of different parallelism for accelerating modular operations. The sequence of scalar multiplications is also accelerated by exploiting Instruct...
متن کاملReconfigurable Implementation of Elliptic Curve Crypto Algorithms
For FPGA based coprocessors for elliptic curve cryptography, a significant performance gain can be achieved when hybrid coordinates are used to represent points on the elliptic curve. We provide a new area/performance tradeoff analysis of different hybrid representations over fields of characteristic two. Moreover, we present a new generic cryptoprocessor architecture that can be adapted to var...
متن کاملHigh radix parallel architecture for GF(p) elliptic curve processor
A new GF(p) cryptographic processor architecture for elliptic curve encryption/decryption is proposed in this paper. The architecture takes advantage of projective coordinates to convert GF(p) inversion needed in elliptic point operations into several multiplication steps. Unlike existing sequential designs, we show that projecting into (X/Z,Y/Z) leads to a much better improved performance than...
متن کاملInstruction Set Extensions for Fast Arithmetic in Finite Fields GF(p) and GF(2)
Instruction set extensions are a small number of custom instructions specifically designed to accelerate the processing of a given kind of workload such as multimedia or cryptography. Enhancing a general-purpose RISC processor with a few application-specific instructions to facilitate the inner loop operations of public-key cryptosystems can result in a significant performance gain. In this pap...
متن کامل